Subsampling in Smoothed Range Spaces
نویسندگان
چکیده
We consider smoothed versions of geometric range spaces, so an element of the ground set (e.g. a point) can be contained in a range with a non-binary value in [0, 1]. Similar notions have been considered for kernels; we extend them to more general types of ranges. We then consider approximations of these range spaces through ε-nets and εsamples (aka ε-approximations). We characterize when size bounds for ε-samples on kernels can be extended to these more general smoothed range spaces. We also describe new generalizations for ε-nets to these range spaces and show when results from binary range spaces can carry over to these smoothed ones.
منابع مشابه
K-sample Subsampling
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We show the asymptotic validity of subsampling confidence intervals and hypothesis tests in the case of independent samples, and give a comparison to the bootstrap in the K-sample setting.
متن کاملK-sample subsampling in general spaces: The case of independent time series
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case where each sample is a stationary time series, and construct subsampling confidence intervals and hypothesis tests with asymptotic validity. Some examples are also given, and the problem of optimal block size choice is...
متن کاملCaratheodory-Tchakaloff Subsampling
We present a brief survey on the compression of discrete measures by Caratheodory-Tchakaloff Subsampling, its implementation by Linear or Quadratic Programming and the application to multivariate polynomial Least Squares. We also give an algorithm that computes the corresponding CaratheodoryTchakaloff (CATCH) points and weights for polynomial spaces on compact sets and manifolds in 2D and 3D. 2...
متن کاملA Novel Subsampling Method for 3D Multimodality Medical Image Registration Based on Mutual Information
Mutual information (MI) is a widely used similarity metric for multimodality image registration. However, it involves an extremely high computational time especially when it is applied to volume images. Moreover, its robustness is affected by existence of local maxima. The multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...
متن کاملTitle : Evaluation of Chroma Subsampling for High Dynamic Range Video Compression
This contribution evaluates the impact of chroma subsampling using two different downsampling filters using objective metric. Objective results show that distributing 4:4:4 is more efficient than its 4:2:0 counterpart for medium to high bit-rates. For low bit-rates, this increase in efficiency is reduced and in some cases even reversed.
متن کامل